翻訳と辞書
Words near each other
・ Condor of Bermuda
・ Condor Peninsula
・ CONDOR secure cell phone
・ Condor Shoestring
・ Condor Syndikat
・ Condor Trilogy
・ Condor, Alberta
・ Condor, Rio Grande do Sul
・ Condor-class gunvessel
・ Condor-class sloop
・ Condorcanqui Province
・ Condorcet (crater)
・ Condorcet (disambiguation)
・ Condorcet criterion
・ Condorcet loser criterion
Condorcet method
・ Condorcet's jury theorem
・ Condorcet, Drôme
・ Condorchelys
・ Condorism
・ Condorito
・ Condorman
・ Condormarca District
・ Condoroma District
・ Condorraptor
・ Condorrat
・ Condosity
・ Condoto
・ Condottieri
・ Condottieri (1937 film)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Condorcet method : ウィキペディア英語版
Condorcet method

A Condorcet method () is any election method that elects the candidate that would win by majority rule in all pairings against the other candidates, whenever one of the candidates has that property. A candidate with that property is called a ''Condorcet winner'' (named for the 18th-century French mathematician and philosopher Marie Jean Antoine Nicolas Caritat, the Marquis de Condorcet, who championed such outcomes). A Condorcet winner doesn't always exist because majority preferences can be like rock-paper-scissors: for each candidate, there can be another that is preferred by some majority (this is known as Condorcet paradox).
Voting methods that always elect the Condorcet winner (when one exists) are the ones that satisfy the Condorcet criterion.
Most Condorcet methods have a single round of voting, in which each voter ranks the candidates from top to bottom. A voter's ranking is often called his or her ''order of preference,'' although it may not match his or her sincere order of preference since voters are free to rank in any order they choose and may have strategic reasons to misrepresent preferences. There are many ways that the votes can be tallied to find a winner, and not all ways will elect the Condorcet winner whenever one exists. The methods that will—the Condorcet methods—can elect different winners when no candidate is a Condorcet winner. Thus the Condorcet methods can differ on which other criteria they satisfy.
The Robert's Rules method for voting on motions and amendments is also a Condorcet method even though the voters do not vote by expressing their orders of preference. There are multiple rounds of voting, and in each round the vote is between two of the alternatives. The loser (by majority rule) of a pairing is eliminated, and the winner of a pairing survives to be paired in a later round against another alternative. Eventually only one alternative remains, and it is the winner. This is analogous to a single-winner tournament; the total number of pairings is one less than the number of alternatives. Since a Condorcet winner will win by majority rule in each of its pairings, it will never be eliminated by Robert's Rules. But this method cannot reveal a voting paradox in which there is no Condorcet winner and a majority prefer an early loser over the eventual winner. A considerable portion of the literature on social choice theory is about the properties of this method since it is widely used and is used by important organizations (legislatures, councils, committees, etc.). It is not practical for use in public elections, however, since its multiple rounds of voting would be very expensive for voters, for candidates, and for governments to administer.
Ramon Llull devised the earliest known Condorcet method in 1299. His method did not have voters express orders of preference; instead, it had a round of voting for each of the possible pairings of candidates. (This was more like the Robert's Rules method except it was analogous to a round-robin tournament instead of a single-elimination tournament.) The winner was the alternative that won the most pairings.
==Summary==

*Each voter ranks the candidates in order of preference (top-to-bottom, or best-to-worst, or 1st, 2nd, 3rd, etc.). The voter may be allowed to rank candidates as equals, to express indifference between them. To save time, candidates omitted by a voter may be treated as if the voter ranked them at the bottom.
*For each pairing of candidates (as in a round-robin tournament) count how many votes rank each candidate over the other candidate. Thus each pairing will have two totals: the size of its majority and the size of its minority.
For most Condorcet methods, those counts usually suffice to determine the complete order of finish. They always suffice to determine whether there is a Condorcet winner. Additional information may be needed in the event of ties. Ties can be pairings that have no majority, or they can be majorities that are the same size; these ties will be rare when there are many voters. Some Condorcet methods may have other kinds of ties; for example, it would not be rare for two or more candidates to win the same number of pairings, when there is no Condorcet winner.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Condorcet method」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.